Entropy and Average Cost of AUH Codes
نویسندگان
چکیده
In this paper we address the class of anti-uniform Huffman (AUH) codes, named also unary codes, for sources with finite and infinite alphabet, respectively. Geometric, quasi-geometric, Fibonacci, exponential, Poisson, and negative binomial distributions lead to anti – uniform sources for some ranges of their parameters. Huffman coding of these sources results in AUH codes. We prove that as result of this encoding, in general, sources with memory are obtained. For these sources we attach the graph and determine the transition matrix between states, the state probabilities and the entropy. If c0 and c1 denote the costs for storing or transmission of symbols “0” and “1”, respectively, we compute the average cost for these AUH codes.
منابع مشابه
Infinite anti-uniform sources
In this paper we consider the class of anti-uniform Huffman (AUH) codes for sources with infinite alphabet. Poisson, negative binomial, geometric and exponential distributions lead to infinite anti – uniform sources for some ranges of their parameters. Huffman coding of these sources results in AUH codes. We prove that as a result of this encoding, we obtain sources with memory. For these sourc...
متن کاملTight Bounds on the Average Length, Entropy, and Redundancy of Anti-Uniform Huffman Codes
In this paper we consider the class of anti-uniform Huffman codes and derive tight lower and upper bounds on the average length, entropy, and redundancy of such codes in terms of the alphabet size of the source. The Fibonacci distributions are introduced which play a fundamental role in AUH codes. It is shown that such distributions maximize the average length and the entropy of the code for a ...
متن کاملOn the cost of worst case coding length constraints
We investigate the redundancy that arises from adding a worst case length constraint to uniquely decodable fixed-to-variable codes over achievable Huffman codes. This is in contrast to the traditional metric of the redundancy over the entropy. We show that the cost for adding constraints on the worst case coding length is small, and that the resulting bound is related to the Fibonacci numbers.
متن کاملThe Rényi redundancy of generalized Huffman codes
If optimality is measured by average codeword length, Huffman's algorithm gives optimal codes, and the redundancy can be measured as the difference between the average codeword length and Shannon's entropy. If the objective function is replaced by an exponentially weighted average, then a simple modification of Huffman's algorithm gives optimal codes. The redundancy can now be measured as the d...
متن کاملA small-molecule compound identified through a cell-based screening inhibits JAK/STAT pathway signaling in human cancer cells.
Inappropriate activation of JAK/STAT signaling occurs with high frequency in human cancers and is associated with cancer cell survival and proliferation. Therefore, the development of pharmacologic STAT signaling inhibitors has therapeutic potential in the treatment of human cancers. Here, we report 2-[(3,5-bis-trifluoromethyl-phenyl)-hydroxy-methyl]-1-(4-nitro-phenylamino)-6-phenyl-1,2,4a,7a-t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013